Personalized sampling graph collection with local differential privacy for link prediction
نویسندگان
چکیده
Link prediction (LP) is an attractive research problem on social network data. Yet, the link information may be leaked by untrusted collector. As countermeasures, there are a few methods specially designed for under local differential privacy (LDP), which allow third-party data collector collects user while protecting connection privacy. In this paper, we propose C ommunity-based graph collection with P ersonalized sampling R andomized esponse (CPRR) novel algorithm LDP and reaches decent trade-off between sensitive protection performance. The proposed mechanism adopts personalized technique each of then utlizes randomized response sampled subset. Based technique, can reduce injected noise in LDP. Meanwhile, considering different edge distributions regions original graph, community-based strategy. Then, prove that CPRR satisfies Through extensive experiments several real-life datasets, demonstrate achieve better results balancing performance than state-of-art baselines.
منابع مشابه
Differential Privacy By Sampling
In this paper we present the Sampling Privacy mechanism for privately releasing personal data. Sampling Privacy is a sampling based privacy mechanism that satisfies differential privacy.
متن کاملPerformance of Local Information Based Link Prediction: A Sampling Perspective
Link prediction is pervasively employed to uncover the missing links in the snapshots of real-world networks, which are usually obtained from kinds of sampling methods. Contrarily, in the previous literature, in order to evaluate the performance of the prediction, the known edges in the sampled snapshot are divided into the training set and the probe set randomly, without considering the divers...
متن کاملRenyi Differential Privacy Mechanisms for Posterior Sampling
With the newly proposed privacy definition of Rényi Differential Privacy (RDP) in [15], we re-examine the inherent privacy of releasing a single sample from a posterior distribution. We exploit the impact of the prior distribution in mitigating the influence of individual data points. In particular, we focus on sampling from an exponential family and specific generalized linear models, such as ...
متن کاملPrivacy-Integrated Graph Clustering Through Differential Privacy
Data mining tasks like graph clustering can automatically process a large amount of data and retrieve valuable information. However, publishing such graph clustering results also involves privacy risks. In particular, linking the result with available background knowledge can disclose private information of the data set. The strong privacy guarantees of the differential privacy model allow copi...
متن کاملDistributed Differential Privacy By Sampling
In this paper, we describe our approach to achieve distributed differential privacy by sampling alone. Our mechanism works in the semihonest setting (honest-but-curious whereby aggregators attempt to peek at the data though follow the protocol). We show that the utility remains constant and does not degrade due to the variance as compared to the randomized response mechanism. In addition, we sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: World Wide Web
سال: 2023
ISSN: ['1573-1413', '1386-145X']
DOI: https://doi.org/10.1007/s11280-023-01136-4